Fixed-parameter tractability and lower bounds for stabbing problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed-parameter tractability and lower bounds for stabbing problems

We study the following general stabbing problem from a parameterized complexity point of view: Given a set S of n translates of an object in R, find a set of k lines with the property that every object in S is ”stabbed” (intersected) by at least one line. We show that when S consists of axis-parallel unit squares in R the (decision) problem of stabbing S with axis-parallel lines is W[1]-hard wi...

متن کامل

Fixed Parameter Tractability and Treewidth 14 . 1 Fixed Parameter Tractability

One of the ways to cope with hard problems in practice is to realized that problem instances may be associated with some “parameters” related to their complexity. If the parameter of an instance is small, we might have some hope in finding a polynomial time solution to that instance. This idea has been investigated in the 1990’s by Downian and Fellowes in their work on fixed parameter tractabil...

متن کامل

Lower Bounds for Line Stabbing

We present an (n log n) xed order algebraic decision tree lower bound for determining the existence of a line stabber for a family of n line segments in the plane. We give the same lower bound for determining the existence of a line stabber for n translates of a circle in the plane. In proving this lower bound, we show that this problem is equivalent to determining if the width of a set of poin...

متن کامل

Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties

This paper is concerned with the fixed-parameter tractability of the problem of deciding whether a graph can be made into a graph with a specified hereditary property by deleting at most i vertices, at most j edges, and adding at most k edges, where i, j, k are fixed integers. It is shown that this problem is fixed-parameter tractable whenever the hereditary property can be characterized by a f...

متن کامل

Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments

Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed-parameter tractability results for these problems. We show that Feedback Vertex Set in tournaments is amenable to the novel iterative compression technique. Moreover, we provide data reductions and problem kernels fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 2013

ISSN: 0925-7721

DOI: 10.1016/j.comgeo.2011.06.005